Budgeted Allocations in the Full-Information Setting
نویسنده
چکیده
We build on the work of Andelman & Mansour and Azar, Birnbaum, Karlin, Mathieu & Thach Nguyen to show that the fullinformation (i.e., offline) budgeted-allocation problem can be approximated to within 4/3: we conduct a rounding of the natural LP relaxation, for which our algorithm matches the known lower-bound on the integrality gap.
منابع مشابه
Social Value of Information and Optimal Communication Policy of Central Banks
Monetary policy as a tool for expectations management is believed to be most effective if it can coordinate the beliefs and expectations of the economic agents. The optimal communication policy is in an environment where central bank announcements are common knowledge and abundant information is complete transparency. The above conclusion is altered in the more realistic situation where economi...
متن کاملImproved Approximation Algorithms for Budgeted Allocations
We provide a 3/2-approximation algorithm for an offline budgeted allocations problem with applications to sponsored search auctions. This an improvement over the e/(e−1) approximation of Andelman and Mansour [1] and the e/(e − 1) − approximation (for ≈ 0.0001) of Feige and Vondrak [2] for the more general Maximum Submodular Welfare (SMW) problem. For a special case of our problem, we improve th...
متن کاملRevenue Maximizing Envy-Free Fixed-Price Auctions with Budgets
Traditional incentive-compatible auctions for selling multiple goods to unconstrained and budgeted bidders can discriminate between bidders by selling identical goods at different prices. For this reason, A recent study by Feldman et al. dropped incentive compatibility and turned the attention to revenue maximizing envy-free item-pricing allocations for budgeted bidders. Envy-free allocations w...
متن کاملAttribute Efficient Linear Regression with Data-Dependent Sampling
In this paper we analyze a budgeted learning setting, in which the learner can only choose and observe a small subset of the attributes of each training example. We develop efficient algorithms for ridge and lasso linear regression, which utilize the geometry of the data by a novel data-dependent sampling scheme. When the learner has prior knowledge on the second moments of the attributes, the ...
متن کاملBounded rational learning in differential information economies: core and value
We apply the private core and the private value to a dynamic economy and study the evolution of private core and private value allocations as individuals acquire information Ž . learn through time. In particular, a realized agreement in each period generates information that changes the underlying information structure in the economy. Since the private Ž . core value depends on the distribution...
متن کامل